HEVC ” article published in the IEEE Selected Topics in Signal Processing,

the following text. For binary arithmetic coding, a given non-binary absolute value has to be binarized, i.e., decomposed into a sequence of binary de-cisions (bin string). Two information related to transform coefficient level coding are non-binary: the last significant scan position and the absolute levels. 1) Last Significant Scan Position: The binarization of its and co-ordinates is a composition of a truncated unary prefix and a fixed-length suffix. Since the same binarization process is used for both coordi-nates, the following description uses as a substitution for and. Each prefix bin with an index denotes the decision for, with. The maximum prefix length is constrained by and N denotes the TB size. A suffix is present when the prefix consists of more than four bins, i.e.,. This is exactly the case when the difference between two neigh-bouring entries in is greater than one. As a consequence for 4 4 TBs, the binarization always results in a bin string without suffix.When a suffix is present, the remaining value is decomposed by the fixed-length scheme with a number of bins equal to. 2) Absolute Level: The binarization of absolute levels, denoted as in the following, is a decomposition into four different syntax elements. They are referred to as significance flag, absolute level greater than 1, absolute level greater than 2, and remaining ab-solute level. At decoder side, can be reconstructed simply by sum up the values of the syntax elements as denoted in the following